0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.10 % Command : run_E %s %d THM 0.09/0.30 % Computer : n023.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 1440 0.09/0.30 % WCLimit : 180 0.09/0.30 % DateTime : Thu Jul 4 07:41:53 EDT 2024 0.09/0.30 % CPUTime : 0.15/0.41 Running higher-order theorem proving 0.15/0.42 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.Zcg5YLhieN/E---3.1_18211.p 0.15/0.44 # Version: 3.2.0-ho 0.15/0.44 # Preprocessing class: HSSSSMSSSSSNSSA. 0.15/0.44 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.15/0.44 # Starting post_as_ho12 with 180s (1) cores 0.15/0.44 # Starting new_bool_9 with 180s (1) cores 0.15/0.44 # Starting post_as_ho1 with 180s (1) cores 0.15/0.44 # Starting post_as_ho4 with 180s (1) cores 0.15/0.44 # Starting post_as_ho2 with 180s (1) cores 0.15/0.44 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.15/0.44 # Starting full_lambda_10 with 180s (1) cores 0.15/0.44 # Starting new_ho_8 with 180s (1) cores 0.15/0.44 # post_as_ho12 with pid 18289 completed with status 0 0.15/0.44 # Result found by post_as_ho12 0.15/0.44 # Preprocessing class: HSSSSMSSSSSNSSA. 0.15/0.44 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.15/0.44 # Starting post_as_ho12 with 180s (1) cores 0.15/0.44 # No SInE strategy applied 0.15/0.44 # Search class: HGUSF-FFSF21-SSSFFSBN 0.15/0.44 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.15/0.44 # Starting post_as_ho12 with 109s (1) cores 0.15/0.44 # post_as_ho12 with pid 18297 completed with status 9 0.15/0.44 # Starting lpo8_s with 19s (1) cores 0.15/0.44 # lpo8_s with pid 18307 completed with status 0 0.15/0.44 # Result found by lpo8_s 0.15/0.44 # Preprocessing class: HSSSSMSSSSSNSSA. 0.15/0.44 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.15/0.44 # Starting post_as_ho12 with 180s (1) cores 0.15/0.44 # No SInE strategy applied 0.15/0.44 # Search class: HGUSF-FFSF21-SSSFFSBN 0.15/0.44 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.15/0.44 # Starting post_as_ho12 with 109s (1) cores 0.15/0.44 # post_as_ho12 with pid 18297 completed with status 9 0.15/0.44 # Starting lpo8_s with 19s (1) cores 0.15/0.44 # Preprocessing time : 0.001 s 0.15/0.44 # Presaturation interreduction done 0.15/0.44 0.15/0.44 # Proof found! 0.15/0.44 # SZS status Theorem 0.15/0.44 # SZS output start CNFRefutation 0.15/0.44 thf(decl_sort1, type, a: $tType). 0.15/0.44 thf(decl_22, type, cP: a > a > a). 0.15/0.44 thf(decl_23, type, cZ: a). 0.15/0.44 thf(decl_24, type, esk1_1: (a > $o) > a). 0.15/0.44 thf(decl_25, type, esk2_1: (a > $o) > a). 0.15/0.44 thf(decl_26, type, esk3_0: a). 0.15/0.44 thf(cS_LEM1D_pme, conjecture, (![X1:a]:((((X1)=(cZ))|?[X2:a, X3:a]:(((X1)=(cP @ X2 @ X3)))))<=((![X4:a > $o]:((![X1:a]:((X4 @ X1))<=((X4 @ cZ)&![X1:a, X2:a]:((((X4 @ X1)&(X4 @ X2))=>(X4 @ (cP @ X1 @ X2)))))))&![X1:a, X2:a, X5:a, X6:a]:((((cP @ X1 @ X5)=(cP @ X2 @ X6))=>(((X1)=(X2))&((X5)=(X6))))))&![X1:a, X2:a]:(((cP @ X1 @ X2)!=(cZ))))), file('/export/starexec/sandbox/tmp/tmp.Zcg5YLhieN/E---3.1_18211.p', cS_LEM1D_pme)). 0.15/0.44 thf(c_0_1, negated_conjecture, ~((((![X4:a > $o]:((((X4 @ cZ)&![X1:a, X2:a]:((((X4 @ X1)&(X4 @ X2))=>(X4 @ (cP @ X1 @ X2)))))=>![X1:a]:((X4 @ X1))))&![X1:a, X2:a, X5:a, X6:a]:((((cP @ X1 @ X5)=(cP @ X2 @ X6))=>(((X1)=(X2))&((X5)=(X6))))))&![X1:a, X2:a]:(((cP @ X1 @ X2)!=(cZ))))=>![X1:a]:((((X1)=(cZ))|?[X2:a, X3:a]:(((X1)=(cP @ X2 @ X3))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_LEM1D_pme])])). 0.15/0.44 thf(c_0_2, negated_conjecture, ![X20:a > $o, X23:a, X24:a, X25:a, X26:a, X27:a, X28:a, X29:a, X31:a, X32:a]:((((((((X20 @ (esk1_1 @ X20))|~(X20 @ cZ)|(X20 @ X23))&((X20 @ (esk2_1 @ X20))|~(X20 @ cZ)|(X20 @ X23)))&(~(X20 @ (cP @ (esk1_1 @ X20) @ (esk2_1 @ X20)))|~(X20 @ cZ)|(X20 @ X23)))&((((X24)=(X25))|((cP @ X24 @ X26)!=(cP @ X25 @ X27)))&(((X26)=(X27))|((cP @ X24 @ X26)!=(cP @ X25 @ X27)))))&((cP @ X28 @ X29)!=(cZ)))&(((esk3_0)!=(cZ))&((esk3_0)!=(cP @ X31 @ X32))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 0.15/0.44 thf(c_0_3, negated_conjecture, ![X1:a, X4:a > $o]:(((X4 @ X1)|~((X4 @ (cP @ (esk1_1 @ X4) @ (esk2_1 @ X4))))|~((X4 @ cZ)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.44 thf(c_0_4, negated_conjecture, ![X1:a, X2:a]:(((esk3_0)!=(cP @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.44 thf(c_0_5, negated_conjecture, ![X1:a]:((((cP @ (esk1_1 @ (^[Z0/* 4 */:a]:(((Z0)!=(X1))))) @ (esk2_1 @ (^[Z0/* 4 */:a]:(((Z0)!=(X1))))))=(X1))|((cZ)=(X1)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_3])). 0.15/0.44 thf(c_0_6, negated_conjecture, ((esk3_0)!=(cZ)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.44 thf(c_0_7, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_4, c_0_5])]), c_0_6]), ['proof']). 0.15/0.44 # SZS output end CNFRefutation 0.15/0.44 # Parsed axioms : 4 0.15/0.44 # Removed by relevancy pruning/SinE : 0 0.15/0.44 # Initial clauses : 11 0.15/0.44 # Removed in clause preprocessing : 3 0.15/0.44 # Initial clauses in saturation : 8 0.15/0.44 # Processed clauses : 24 0.15/0.44 # ...of these trivial : 0 0.15/0.44 # ...subsumed : 3 0.15/0.44 # ...remaining for further processing : 21 0.15/0.44 # Other redundant clauses eliminated : 5 0.15/0.44 # Clauses deleted for lack of memory : 0 0.15/0.44 # Backward-subsumed : 0 0.15/0.44 # Backward-rewritten : 0 0.15/0.44 # Generated clauses : 27 0.15/0.44 # ...of the previous two non-redundant : 11 0.15/0.44 # ...aggressively subsumed : 0 0.15/0.44 # Contextual simplify-reflections : 0 0.15/0.44 # Paramodulations : 9 0.15/0.44 # Factorizations : 0 0.15/0.44 # NegExts : 0 0.15/0.44 # Equation resolutions : 7 0.15/0.44 # Disequality decompositions : 0 0.15/0.44 # Total rewrite steps : 4 0.15/0.44 # ...of those cached : 2 0.15/0.44 # Propositional unsat checks : 0 0.15/0.44 # Propositional check models : 0 0.15/0.44 # Propositional check unsatisfiable : 0 0.15/0.44 # Propositional clauses : 0 0.15/0.44 # Propositional clauses after purity: 0 0.15/0.44 # Propositional unsat core size : 0 0.15/0.44 # Propositional preprocessing time : 0.000 0.15/0.44 # Propositional encoding time : 0.000 0.15/0.44 # Propositional solver time : 0.000 0.15/0.44 # Success case prop preproc time : 0.000 0.15/0.44 # Success case prop encoding time : 0.000 0.15/0.44 # Success case prop solver time : 0.000 0.15/0.44 # Current number of processed clauses : 13 0.15/0.44 # Positive orientable unit clauses : 2 0.15/0.44 # Positive unorientable unit clauses: 0 0.15/0.44 # Negative unit clauses : 3 0.15/0.44 # Non-unit-clauses : 8 0.15/0.44 # Current number of unprocessed clauses: 0 0.15/0.44 # ...number of literals in the above : 0 0.15/0.44 # Current number of archived formulas : 0 0.15/0.44 # Current number of archived clauses : 8 0.15/0.44 # Clause-clause subsumption calls (NU) : 11 0.15/0.44 # Rec. Clause-clause subsumption calls : 11 0.15/0.44 # Non-unit clause-clause subsumptions : 0 0.15/0.44 # Unit Clause-clause subsumption calls : 2 0.15/0.44 # Rewrite failures with RHS unbound : 0 0.15/0.44 # BW rewrite match attempts : 0 0.15/0.44 # BW rewrite match successes : 0 0.15/0.44 # Condensation attempts : 24 0.15/0.44 # Condensation successes : 2 0.15/0.44 # Termbank termtop insertions : 1121 0.15/0.44 # Search garbage collected termcells : 323 0.15/0.44 0.15/0.44 # ------------------------------------------------- 0.15/0.44 # User time : 0.010 s 0.15/0.44 # System time : 0.003 s 0.15/0.44 # Total time : 0.013 s 0.15/0.44 # Maximum resident set size: 1844 pages 0.15/0.44 0.15/0.44 # ------------------------------------------------- 0.15/0.44 # User time : 0.010 s 0.15/0.44 # System time : 0.006 s 0.15/0.44 # Total time : 0.016 s 0.15/0.44 # Maximum resident set size: 1720 pages 0.15/0.44 % E---3.1 exiting 0.15/0.44 % E exiting 0.15/0.44 EOF